Inversion of band matrices

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative inversion of structured matrices

Iterative processes for the inversion of structured matrices can be further improved by using a technique for compression and refinement via the least-squares computation. We review such processes and elaborate upon incorporation of this technique into the known frameworks.

متن کامل

Parallel Inversion of Polynomial Matrices

This paper presents an overview of diierent methods proposed in the last several decades for computing the inverse of a polynomial matrix, concentrating on Buss lowicz's algorithm. A detailed description of Buss lowicz's algorithm and its sequential implementation is followed by the presentation of a new parallel algorithm, based on Buss lowicz's. The distributed and shared memory versions of t...

متن کامل

Inversion of general tridiagonal matrices

In the current work, the authors present a symbolic algorithm for finding the inverse of any general nonsingular tridiagonal matrix. The algorithm is mainly based on the work presented in [Y. Huang, W.F. McColl, Analytic inversion of general tridiagonal matrices, J. Phys. A 30 (1997) 7919–7933] and [M.E.A. El-Mikkawy, A fast algorithm for evaluating nth order tridiagonal determinants, J. Comput...

متن کامل

Quaternionic Matrices: Inversion and Determinant ∗

We discuss the Schur complement formula for quaternionic matrices, M , and give an efficient method to calculate the matrix inverse. We also introduce the functional D[M ] which extends to quaternionic matrices the non-negative number |det[M ]|. 1. Introduction. Much of the spectral theory of complex matrices does not extend to quaternion matrices without further modifications [1, 2, 3]. In par...

متن کامل

Fast inversion of Chebyshev { Vandermonde matrices 1

This paper contains two fast algorithms for inversion of ChebyshevvVander-monde matrices of the rst and second kind. They are based on special representations of the Bezoutians of Chebyshev polynomials of both kinds. The paper also contains the results of numerical experiments which show that the algorithms proposed here are not only much faster, but also more stable than other algorithms avail...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1979

ISSN: 0024-3795

DOI: 10.1016/0024-3795(79)90151-4